Optimal Geometric Partitions, Covers and K-Centers
نویسندگان
چکیده
In this paper we present some new, practical, geometric optimization techniques for computing polygon partitions, 1D and 2D point, interval, square and rectangle covers, as well as 1D and 2D interval and rectangle K-centers. All the techniques we present have immediate applications to several cost optimization and facility location problems which are quite common in practice. The main technique employed is dynamic programming, but we also make use of efficient data structures and fast greedy algorithms. Key-Words: polygon partition, point cover, interval cover, rectangle cover, interval K-center, dynamic programming.
منابع مشابه
Improved Univariate Microaggregation for Integer Values
Privacy issues during data publishing is an increasing concern of involved entities. The problem is addressed in the field of statistical disclosure control with the aim of producing protected datasets that are also useful for interested end users such as government agencies and research communities. The problem of producing useful protected datasets is addressed in multiple computational priva...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملQuery Complexity of Sampling and Small Geometric Partitions
In this paper we study the following problem: Discrete partitioning problem (DPP): Let FqP denote the n-dimensional finite projective space over Fq. For positive integer k ≤ n, let {A}i=1 be a partition of (FqP ) such that 1. for all i ≤ N , A = ∏k j=1 A i j (partition into product sets), 2. for all i ≤ N , there is a (k − 1)-dimensional subspace L ⊆ FqP such that A ⊆ (L). What is the minimum v...
متن کاملk-optimal Partitions of a Directed Graph
A partition M is k-optimal if M minimizes BdM). For instance, if G has a Hamiltonian path J.Lo, then M = W.o} is a k -optimal partition. So the k -optimal partitions extend in some sense the concept of Hamiltonian paths. The theorem of Greene and Kleitman [10], which extends the Dilworth theorem [5], shows an important property of k-optimal partitions for the graph of a partially ordered set (i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0908.3652 شماره
صفحات -
تاریخ انتشار 2008